Specifying a positive threshold function via extremal points
نویسندگان
چکیده
An extremal point of a positive threshold Boolean function f is either a maximal zero or a minimal one. It is known that if f depends on all its variables, then the set of its extremal points completely specifies f within the universe of threshold functions. However, in some cases, f can be specified by a smaller set. The minimum number of points in such a set is the specification number of f . It was shown in [S.-T. Hu. Threshold Logic, 1965] that the specification number of a threshold function of n variables is at least n+ 1. In [M. Anthony, G. Brightwell, and J. Shawe-Taylor. On specifying Boolean functions by labelled examples. Discrete Applied Mathematics, 1995] it was proved that this bound is attained for nested functions and conjectured that for all other threshold functions the specification number is strictly greater than n+1. In the present paper, we resolve this conjecture negatively by exhibiting threshold Boolean functions of n variables, which are non-nested and for which the specification number is n + 1. On the other hand, we show that the set of extremal points satisfies the statement of the conjecture, i.e. a positive threshold Boolean function depending on all its n variables has n+ 1 extremal points if and only if it is nested. To prove this, we reveal an underlying structure of the set of extremal points.
منابع مشابه
Extremal Positive Solutions For The Distributed Order Fractional Hybrid Differential Equations
In this article, we prove the existence of extremal positive solution for the distributed order fractional hybrid differential equation$$int_{0}^{1}b(q)D^{q}[frac{x(t)}{f(t,x(t))}]dq=g(t,x(t)),$$using a fixed point theorem in the Banach algebras. This proof is given in two cases of the continuous and discontinuous function $g$, under the generalized Lipschitz and Caratheodory conditions.
متن کاملExtremal versus additive Matérn point processes
In the simplest Matérn point processes, one retains certain points of a Poisson point process in such a way that no pairs of points are at distance less than a threshold. This condition can be reinterpreted as a threshold condition on an extremal shot–noise field associated with the Poisson point process. This paper is focused on the case where one retains points that satisfy a threshold condit...
متن کاملOptimizing Partitions of Percolating Graphs
The partitioning of random graphs is investigated numerically using \simulated annealing" and \extremal optimization." While generally an NP-hard problem, it is shown that the optimization of the graph partitions is particularly diicult for sparse graphs with average connectivities near the percolation threshold. At this threshold, the relative error of \simulated annealing" is found to diverge...
متن کاملExtremal Systems of Points and Numerical Integration on the Sphere
This paper considers extremal systems of points on the unit sphere Sr ⊆ Rr+1, related problems of numerical integration and geometrical properties of extremal systems. Extremal systems are systems of dn = dim Pn points, where Pn is the space of spherical polynomials of degree at most n, which maximize the determinant of an interpolation matrix. Extremal systems for S2 of degrees up to 191 (36, ...
متن کاملLearning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes t...
متن کامل